Global and local asymptotics for the busy period of an M/G/1 queue
نویسندگان
چکیده
منابع مشابه
Global and local asymptotics for the busy period of an M/G/1 queue
We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. This analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of the M/G/1 queue. 2000 Mathematics Subject Classification: 60K25, 60G50, 60F10.
متن کاملSojourn time asymptotics in the MG1 processor sharing queue
We show for the M/G/1 processor sharing queue that the service time distribution is regularly varying of index −ν, ν non-integer, iff the sojourn time distribution is regularly varying of index −ν. This result is derived from a new expression for the Laplace–Stieltjes transform of the sojourn time distribution. That expression also leads to other new properties for the sojourn time distribution...
متن کاملError Analysis of the Mean Busy Period of a Queue
The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.
متن کاملnano-rods zno as an efficient catalyst for the synthesis of chromene phosphonates, direct amidation and formylation of amines
چکیده ندارد.
Transient queue length and busy period of the BMAP / PH / 1 queue
We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2010
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-010-9167-0